An O (log N ) deterministic packet-routing scheme
نویسندگان
چکیده
منابع مشابه
O(log n) dynamic packet routing
A data structure that permits you to find longest matching prefixes as well as to insert and delete a prefix in O(logn) time, where n is the number of prefixes in the router table is developed. Experiment results using a real IPv4 routing database are also presented.
متن کاملAn n log n Alogrithm for Deterministic Kripke Structure Minimization
We introduce an algorithm for the minimization of deterministic Kripke structures with O(kn log2 n) time complexity. We prove the correctness and complexity properties of this algorithm.
متن کاملAn O(n)-space O(log N= Log Log N + F )-query Time Algorithm for 3-d Dominance Reporting
We present a linear-space algorithm for handling the three-dimensional dominance reporting problem: given a set S of n three-dimensional points, design a data structure for S so that the points in S which dominate a given query point can be reported quickly. Under the variation of the RAM model introduced by Fredman and Willard 8], our algorithm achieves O(log n= loglog n + f) query time, where...
متن کاملColoring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors
Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...
متن کاملA Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\log\Delta / \log^2\log\Delta)$ Rounds
We present a deterministic distributed 2-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGESTmodel whose round complexity isO(log n log∆/ log log∆). This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the (2 + ǫ)-approximation algorithm of [BCS17], improving the dependency on ǫ from linear to logari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1992
ISSN: 0004-5411,1557-735X
DOI: 10.1145/147508.147517